单词convex hull
un.: 凸包
网络: 凸壳；凸多边形；凸多边型
凸包
Two dimensional convex hull is one of the typical problems in computational geometry and widely applied in GIS.
二维凸包问题是计算几何领域的经典问题之一，在地理信息系统中有广泛的应用。
The experiment results are used to validate the effectiveness of the scaled convex hull and its simplicity.
实验结果表明，尺度化凸壳方法求解代价敏感问题的有效性，其求解过程也非常简单。
Many different techniques exist for calculating the convex hull of a set of points.
存在着许多不同的方法计算的一个点集凸包。
The convex hull is one of the first problems that was studied in computational geometry.
凸壳认为，在计算几何研究的首要问题之一。
Constructing convex hull of planar point set is a basic algorithm in computational geometry.
求平面点集的凸包是计算几何的一个基本算法。
A scheme of control polygon determination by the triangle convex hull is provided.
给出了由三角形凸包确定控制多边形的方案。
An easy approach is to create a convex hull around an object"s location at two different times.
一条简单的途径就是在2不同的时间在一个物体的地点附近创造凸壳。
This paper introduces the method of convex hull of simple polygons, analyzes the defects of algorithm by Chen.
本文介绍了简单多边形凸包计算的主要思想，分析了陈氏算法的缺点。
An efficient algorithm for computing the convex hull of plane point set is proposed.
提出一种计算平面点集凸壳的快速算法。
The illustration also shows the spline"s convex hull, which is a polygon formed by connecting the four points with straight lines.
该插图还显示样条的凸包，凸包是通过将这四个点用直线相连而形成的多边形。